Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins

We present faster sequential and parallel algorithms for computing the solvent accessible surface area (ASA) of protein molecules. The ASA is computed by finding the exposed surface areas of the spheres obtained by increasing the van der Waals’ radii of the atoms with the van der Waals’ radius of the solvent. Using domain specific knowledge, we show that the number of sphere intersections is only O(n), where n is the number of atoms in the protein molecule. For computing sphere intersections, we present hash-based algorithms that run in O(n) expected sequential time and O ( n p ) expected parallel time and sort-based algorithms that run in worst-case O (n logn) sequential time and O ( n log n p ) parallel time. These are significant improvements over previously known algorithms which take O ( n2 ) time sequentially and O ( n2 p ) time in parallel. We present a Monte Carlo algorithm for computing the solvent accessible surface area. The basic idea is to generate points uniformly at random on the surface of spheres obtained by increasing the van der Waals’ radii of the atoms with the van der Waals’ radius of the solvent molecule and to test the points for accessibility. We also provide error bounds as a function of the sample size. Experimental verification of the algorithms is carried out using an IBM SP-2.